Lecture 8: Random Walks in Undirected Graphs
نویسنده
چکیده
We introduce the notion of a random walk in an undirected graph. What happens after we take T random steps in the walk? We show how to analyze walks and their convergence properties.
منابع مشابه
Random and Pseudo-Random Walks on Graphs
Random walks on graphs have turned out to be a powerful tool in the design of algorithms and other applications. In particular, expander graphs, which are graphs on which random walks have particularly good properties, are extremely useful in complexity and other areas of computer science. In this chapter we study random walks on general regular graphs, leading to a the randomized logspace algo...
متن کاملRandom and Pseudo-Random Walks on Graphs
Random walks on graphs have turned out to be a powerful tool in the design of algorithms and other applications. In particular, expander graphs, which are graphs on which random walks have particularly good properties, are extremely useful in complexity and other areas of computer science. In this chapter we will study random walks on general graphs, leading to a the randomized logspace algorit...
متن کاملh . PR ] 1 5 Ja n 20 02 On the physical relevance of random walks : an example of random walks on a randomly oriented lattice ∗
Random walks on general graphs play an important role in the understanding of the general theory of stochastic processes. Beyond their fundamental interest in probability theory, they arise also as simple models of physical systems. A brief survey of the physical relevance of the notion of random walk on both undirected and directed graphs is given followed by the exposition of some recent resu...
متن کامل3 Stationary Distributions of Random Walks
In today’s lecture, we consider a random walk on an undirected graph. One way to think about a random walk is to imagine somebody walking through a city with no particular goal in mind. At each intersection, he or she chooses a random street to take next. We ask the questions: How long until this person reaches a particular point? How long until he/she has been to every intersection or every st...
متن کاملWalks , and Expander Graphs
I have three goals for this lecture. The first is to introduce one of the most important familes of graphs: expander graphs. They are the source of much combinatorial power, and the counterexample to numerous conjectures. We will become acquainted with these graphs by examining random walks on them. To facilitate the analysis of random walks, we will examine these graphs through their adjacency...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016